Saliency Detection by Multi-Task Sparsity Pursuit(Double Column).dvi

نویسندگان

  • Congyan Lang
  • Guangcan Liu
  • Jian Yu
  • Shuicheng Yan
چکیده

Saliency Detection by Multi-Task Sparsity Pursuit Congyan Lang, Guangcan Liu, Member, IEEE, Jian Yu, and Shuicheng Yan, Senior Member, IEEE, Abstract—This paper addresses the problem of detecting salient areas within natural images. We shall mainly study the problem under unsupervised setting, namely saliency detection without learning from labeled images. A solution of multi-task sparsity pursuit is proposed to integrate multiple types of features for detecting saliency collaboratively. Given an image described by multiple features, its saliency map is inferred by seeking the consistently sparse elements from the joint decompositions of multiple feature matrices into pairs of low-rank and sparse matrices. The inference process is formulated as a constrained nuclear norm and l2,1-norm minimization problem, which is convex and can be solved efficiently with augmented Lagrange multiplier method. Compared to previous methods, which usually make use of multiple features by combining the saliency maps obtained from individual features, the proposed method seamlessly integrates multiple features to jointly produce the saliency map with a single inference step, and thus produces more accurate and reliable results. Besides the unsupervised setting, the proposed method can be also generalized to incorporate the topdown priors obtained from supervised environment. Extensive experiments well validate its superiority over other state-of-theart methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multitask Saliency Detection model for SAR Image and Its Application in SAR and Optical Image Fusion

Saliency detection in synthetic aperture radar (SAR) image is a difficult problem. This paper proposed a multitask saliency detection (MSD) model for the saliency detection task of SAR image. Firstly, we extract four features of SAR image as the input of the MSD model, which include the intensity, orientation, uniqueness and global contrast. Then, the saliency map is generated by the multitask ...

متن کامل

Sparsity Adaptive Matching Pursuit Detection Algorithm Based on Compressed Sensing for Radar Signals

In this paper, the application of the emerging compressed sensing (CS) theory and the geometric characteristics of the targets in radar images are investigated. Currently, the signal detection algorithms based on the CS theory require knowing the prior knowledge of the sparsity of target signals. However, in practice, it is often impossible to know the sparsity in advance. To solve this problem...

متن کامل

Compressed-Sampling-Based Image Saliency Detection in the Wavelet Domain

When watching natural scenes, an overwhelming amount of information is delivered to the Human Visual System (HVS). The optic nerve is estimated to receive around 108 bits of information a second. This large amount of information can’t be processed right away through our neural system. Visual attention mechanism enables HVS to spend neural resources efficiently, only on the selected parts of the...

متن کامل

A Generalized Matching Pursuit Approach for Graph-Structured Sparsity

Sparsity-constrained optimization is an important and challenging problem that has wide applicability in data mining, machine learning, and statistics. In this paper, we focus on sparsity-constrained optimization in cases where the cost function is a general nonlinear function and, in particular, the sparsity constraint is defined by a graph-structured sparsity model. Existing methods explore t...

متن کامل

Technical Report: A Generalized Matching Pursuit Approach for Graph-Structured Sparsity

Sparsity-constrained optimization is an important and challenging problem that has wide applicability in data mining, machine learning, and statistics. In this paper, we focus on sparsity-constrained optimization in cases where the cost function is a general nonlinear function and, in particular, the sparsity constraint is defined by a graph-structured sparsity model. Existing methods explore t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011